A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
نویسندگان
چکیده
Directed s-t connectivity is the problem of detecting whether there is a path from vertex s to vertex t in a directed graph. We present the rst known deterministic sublinear space, polynomial time algorithm for directed s-t connectivity. For n-vertex graphs, our algorithm can use as little as n=2 ( p logn) space while still running in polynomial time.
منابع مشابه
STCON in Directed Unique-Path Graphs
We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON problem is to decide if there exists a path from s to t in G. For general graphs, the best polynomial-time algorithm for STCON uses space that is only slightly sublinear. However, for special classes of directed graphs, polynomi...
متن کاملDeterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space
The s-t connectivity problem for undirected graphs is to decide whether two designated vertices, s and t, are in the same connected component. This paper presents the rst known deterministic algorithms solving undirected s-t connectivity using sublinear space and polynomial time. There is some evidence that such algorithms are impossible for the analogous problem on directed graphs. Our algorit...
متن کاملLecture 4: Random Walks
One of the most basic problems in computer science is that of deciding connectivity in graphs, i.e. S-T Connectivity: Given a directed graph G and two vertices s and t, is there a path from s to t in G? This problem can of course be solved in linear time using breadth-first or depth-first search. However , these algorithms also require linear space. It turns out that S-T Connectivity can in fac...
متن کاملDynamic graph connectivity with improved worst case update time and sublinear space
This paper considers fully dynamic graph algorithms with both faster worst case update time and sublinear space. The fully dynamic graph connectivity problem is the following: given a graph on a fixed set of n nodes, process an online sequence of edge insertions, edge deletions, and queries of the form “Is there a path between nodes a and b?” In 2013, the first data structure was presented with...
متن کاملNew Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs
We obtain the following new simultaneous time-space upper bounds for the directed reachability problem. (1) A polynomial-time, Õ(ng)-space algorithm for directed graphs embedded on orientable surfaces of genus g. (2) A polynomial-time, Õ(n)-space algorithm for all H-minor-free graphs given the tree decomposition, and (3) for K3,3-free and K5-free graphs, a polynomial-time, O(n )-space algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992